Constraint-based Round Robin Tournament Planning
نویسنده
چکیده
Sport tournament planning becomes a complex task in the presence of heterogeneous requirements from teams, media, fans and other parties. Existing approaches to sport tournament planning often rely on precomputed tournament schemes which may be too rigid to cater for these requirements. Existing work on sport tournaments suggests a separation of the planning process into three phases. In this work, it is shown that all three phases can be solved using nite-domain constraint programming. The design of Friar Tuck, a generic constraint-based round robin planning tool, is outlined. New numerical results on round robin tournaments obtained with Friar Tuck underline the potential of constraints over nite domains in this area.
منابع مشابه
Scheduling a Major College Basketball Conference - Revisited
Nemhauser and Trick presented the problem of nding a timetable for the 1997/98 Atlantic Coast Conference (ACC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC. Finite-domain constraint programmingis another programming technique that can be used for solving combinatorial search problems such as sports tournament ...
متن کاملScheduling double round-robin tournaments with divisional play using constraint programming
We propose a tournament format that extends a traditional double round-robin format with divisional single round-robin tournaments. Elitserien, the top Swedish handball league, uses such a format for its league schedule. We introduce a constraint programming model that characterizes the general double round-robin plus divisional single round-robin format. This integrated model allows scheduling...
متن کاملGlobal constraints for round robin tournament scheduling
In the presence of side-constraints and optimization criteria, round robin tournament problems are hard combinatorial problems, commonly tackled with tree search and branch-andbound optimization. Recent results indicate that constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain by exploiting global constraint propagation algorithm...
متن کاملLagrange Relaxation and Constraint Programming Collaborative schemes for Traveling Tournament Problems
This paper presents a study of hybrid algorithms combining Lagrange relaxation and constraint programming on a problem combining round-robin assignment and travel optimization. Traveling Tournament Problems (TTP) have been identified a year ago as very hard problems requiring combinations from techniques of Operations Research (OR) and Constraint Programming (CP). Indeed, constrained round robi...
متن کامل